Some remarks on the model theory of epistemic plausibility models

نویسنده

  • Lorenz Demey
چکیده

Traditional epistemic logic can be seen as a particular branch of modal logic. Its semantics is defined in terms of Kripke models, and philosophical principles about knowledge (e.g. factivity: Kφ→ φ) are shown to correspond to properties of the epistemic accessibility relation (e.g. reflexivity). By adding another (doxastic) accessibility relation, also belief can be treated in this framework. Belief is not assumed to be factive, but at least consistent (¬B⊥), which corresponds to requiring the doxastic accessibility relation to be serial instead of reflexive. In this extended framework, one can study the interaction between knowledge and belief (e.g. is Kφ → Bφ a valid principle?); cf. [5, 8]. Furthermore, since this framework is still ‘just’ a (multi-)modal logic, it inherits the mathematically well-developed model theory of modal logic. However, it is well-known that dynamic phenomena cannot be captured in this framework; cf. section 3.1 of [7]. To remedy this, epistemic plausibility models have been introduced (technical details will be presented later). In these models, one can again study knowledge, belief (and even other cognitive propositional attitudes), and their various interactions. Furthermore, this framework provides a realistic model of various dynamic phenomena, and thus solves the main problem of the previous approach. However, because epistemic plausibility models are much richer structures than Kripke models, they do not straightforwardly inherit the model-theoretical results of modal logic. Therefore, while epistemic plausibility structures are well-suited for modeling purposes, an extensive investigation of their model theory has been lacking so far. The aim of the present paper is to fill exactly this gap, by initiating a systematic exploration of the model theory of epistemic plausibility models. Like in ‘ordinary’ modal logic, the focus will be on the notion of bisimulation — it turns out that finding the right generalization of this notion is not a trivial task. In Section 2, we introduce epistemic plausibility models and discuss some important operators which can be interpreted on such models, and their

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Logic of Conditional Doxastic Actions: A theory of dynamic multi-agent belief revision

We present a logic of conditional doxastic actions, obtained by incorporating ideas from belief revision theory into the usual dynamic logic of epistemic actions. We do this by extending to actions the setting of epistemic plausibility models, developed in Baltag and Smets (2006) for representing (static) conditional beliefs. We introduce a natural extension of the notion of update product from...

متن کامل

Bisimulation for Single-Agent Plausibility Models

Epistemic plausibility models are Kripke models agents use to reason about the knowledge and beliefs of themselves and each other. Restricting ourselves to the single-agent case, we determine when such models are indistinguishable in the logical language containing conditional belief, i.e., we define a proper notion of bisimulation, and prove that bisimulation corresponds to logical equivalence...

متن کامل

Agreeing to disagree in probabilistic dynamic epistemic logic

Aumann’s agreeing to disagree theorem is a central theorem of game theory. This result says that if two agents have a common prior, then they cannot agree (have common knowledge of their posteriors) to disagree (while these posteriors are not identical). This thesis looks at the agreeing to disagree theorem from the perspective of probabilistic dynamic epistemic logic. The first goal of the the...

متن کامل

A General Model for Epistemic State Revision using Plausibility Measures

In this paper, we present a general revision model on epistemic states based on plausibility measures proposed by Friedman and Halpern. We propose our revision strategy and give some desirable properties, e.g., the reversible and commutative properties. Moreover, we develop a notion called plausibility kinematics and show that our revision strategy follows plausibility kinematics. Furthermore, ...

متن کامل

Don’t Plan for the Unexpected: Planning Based on Plausibility Models

We present a framework for automated planning based on plausibility models, as well as algorithms for computing plans in this framework. Our plausibility models include postconditions, as ontic effects are essential for most planning purposes. The framework presented extends a previously developed framework based on dynamic epistemic logic (DEL), without plausibilities/beliefs. In the pure epis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Applied Non-Classical Logics

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011